Bisimulation on Speed: A Unified Approach

نویسندگان

  • Gerald Lüttgen
  • Walter Vogler
چکیده

Two process–algebraic approaches have been developed for comparing two bisimulation–equivalent processes with respect to speed: the one of Moller/Tofts equips actions with lower time bounds, while the other by Lüttgen/Vogler considers upper time bounds instead. This paper sheds new light onto both approaches by testifying to their close relationship and brings the research into bisimulation–based faster– than preorders to a close. We introduce a general, very intuitive concept of “faster–than”, which is formalised by a notion of amortised faster–than preorder. When closing this preorder under all contexts, exactly the two faster–than preorders investigated by Moller/Tofts and Lüttgen/Vogler arise. For processes incorporating both lower and upper time bounds we also show that the largest precongruence contained in the amortised faster–than preorder is not a proper preorder but a timed bisimulation. In the light of this result we systematically investigate under which circumstances the amortised faster–than preorder degrades to an equivalence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unifying bisimulation relations for discrete and continuous systems

The fundamental notion of bisimulation has inspired various notions of system equivalences in concurrency theory. Many notions of bisimulation for various discrete systems have been recently unified in the abstract category theoretical formulation of bisimulation due to Joyal, Nielsen and Winskel. In this paper, we adopt their framework and unify the notions of bisimulation equivalences for dis...

متن کامل

Bisimulation Relations for Dynamical and Control Systems

In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notion of bisimulation introduced by R. Milner for labeled transition systems. It is however, more subtle than its namesake in concurrency theory, mainly due to the fact that here, one deals with relations on manifolds. We ...

متن کامل

Novel Unified Control Method of Induction and Permanent Magnet Synchronous Motors

Many control schemes have been proposed for induction motor and permanent magnet synchronous motor control, which are almost highly complex and non-linear. Also, a simple and efficient method for unified control of the electric moto are rarely investigated. In this paper, a novel control method based on rotor flux orientation is proposed. The novelties of proposed method are elimination of q-ax...

متن کامل

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

متن کامل

Up-to Techniques for Weak Bisimulation

Up-to techniques have been introduced to enhance the bisimulation proof method for establishing bisimilarity results. While up-to techniques for strong bisimilarity are well understood, in the weak case they come as a collection of unrelated results, and lack a unified presentation. We propose a uniform and modular theory of up-to techniques for weak bisimulation that captures existing proof te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 360  شماره 

صفحات  -

تاریخ انتشار 2005